A New Derivative-Free Quasi-Secant Algorithm For Solving Non-Linear Equations
نویسندگان
چکیده
Most of the nonlinear equation solvers do not converge always or they use the derivatives of the function to approximate the root of such equations. Here, we give a derivative-free algorithm that guarantees the convergence. The proposed two-step method, which is to some extent like the secant method, is accompanied with some numerical examples. The illustrative instances manifest that the rate of convergence in proposed algorithm is more than the quadratically iterative schemes. Keywords—Non-linear equation, iterative methods, derivative-free, convergence.
منابع مشابه
Seventh-order iterative algorithm free from second derivative for solving algebraic nonlinear equations
متن کامل
A Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations
Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...
متن کاملIoned Conjugate - and Secant - Newton Non - Linear Problems
The preconditioned conjugate gradient (CG) method is becoming accepted as a powerful tool for solving the linear systems of equations resulting from the application of the finite element method. Applications of the non-linear algorithm are mainly confined to the diagonally scaled CG. In this study the coupling of preconditioning techniques with non-linear versions of the conjugate gradient and ...
متن کاملA new approach for solving the first-order linear matrix differential equations
Abstract. The main contribution of the current paper is to propose a new effective numerical method for solving the first-order linear matrix differential equations. Properties of the Legendre basis operational matrix of integration together with a collocation method are applied to reduce the problem to a coupled linear matrix equations. Afterwards, an iterative algorithm is examined for solvin...
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کامل